Natural proofs
نویسندگان
چکیده
The ultimate goal we have is separating classes (or proving they are equal if they are). But our success so far seems to be limited: We know a (quite) tight time hierarchy, a tight space hierarchy, non-deterministic hierarchies, and some other (weaker) hierarchies. However, we are unable to even prove that LOG 6= P#P or that BPP 6= NEXP. In this lecture we seek some justification to this state of affairs.
منابع مشابه
Presenting Machine-Found Proofs
This paper outlines an implemented system named PROVERB that transforms and abstracts machine-found proofs to natural deduction style proofs at an adequate level of abstraction and then verbalizes them in natural language. The abstracted proofs, originally employed only as an intermediate representation, also prove to be useful for proof planning and proving by analogy.
متن کاملA Translation of Model Elimination Proofs into a Structured Natural Deduction
Model Elimination is a frequently used calculus in automated theorem proving (ATP). Powerful implementations are available. Unfortunately, the automatically generated proofs are not very readable for humans. The Block Calculus is a variant of Natural Deduction that makes it possible to generate struc-tured proofs. It is convenient for natural language proof presentation, and it is also usable f...
متن کاملStructuring Computer Generated Proofs
One of the main disadvantages of computer generated proofs of mathematical theorems is their complexity and incomprehensibility. Proof transformation proce- dures have been designed in order to state these proofs in a formalism that is more familiar to a human ma- thematician. But usually the essential idea of a proof is still not easily visible. We describe a procedure to transform proofs re...
متن کاملPapuq : a Coq assistant ?
We describe an extension to CoqIDE called Papuq, targeted at students learning the basics of mathematical reasoning. The extension tries to bridge the gap between natural language used to teach proofs during the university course and the artificial language of Coq proofs. We believe it will give the students the possibility to practice writing proofs by themselves and at the same time to learn ...
متن کاملCoqatoo: Generating Natural Language Versions of Coq Proofs
Due to their numerous advantages, formal proofs and proof assistants, such as Coq, are becoming increasingly popular. However, one disadvantage of using proof assistants is that the resulting proofs can sometimes be hard to read and understand, particularly for less-experienced users. To address this issue, we have implemented a tool capable of generating natural language versions of Coq proofs...
متن کاملVerifying and Invalidating Textbook Proofs Using Scunak
Many textbook proofs are essentially human-readable representations of natural deduction proofs. Terms in dependent type theory provide formally checkable representations of natural deduction proofs. We show how the new mathematical assistant system Scunak can be used to verify a textbook proof by translating the LTEX version into a proof term in a dependent type theory. We also show how Scunak...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016